Data Augmented Maximum Margin Matrix Factorization for Flickr Group Recommendation
نویسندگان
چکیده
User groups on photo sharing websites, such as Flickr, are self-organized communities to share photos and conversations with similar interest and have gained massive popularity. However, the huge volume of groups brings troubles for users to decide which group to choose. Further, directly applying collaborative filtering techniques to group recommendation will suffer from cold start problem since many users do not affiliate to any group. In this paper, we propose a hybrid recommendation approach named Data Augmented Maximum Margin Matrix Factorization (DAMF), by integrating collaborative user-group information and user similarity graph. Specifically, Maximum Margin Matrix Factorization (MMMF) is employed for the collaborative recommendation, while the user similarity graph obtained from the user uploaded images and annotated tags is used as an complementary part to handle the cold start problem and to improve the performance of MMMF. The experiments conducted on our crawled dataset with 2196 users, 985 groups and 334467 images from Flickr demonstrate the effectiveness of the proposed approach.
منابع مشابه
Sparse Learning via Maximum Margin Matrix Factorization
In this paper, an algorithm for sparse learning via Maximum Margin Matrix Factorization(MMMF) is proposed. The algorithm is based on L1 penality and Alternating Direction Method of Multipliers. It shows that with sparse factors, sparse factors method can obtain result as good as dense factors.
متن کاملPersonalized Landmark Recommendation Based on Geotags from Photo Sharing Sites
Geotagged photos of users on social media sites provide abundant location-based data, which can be exploited for various location-based services, such as travel recommendation. In this paper, we propose a novel approach to a new application, i.e., personalized landmark recommendation based on users’ geotagged photos. We formulate the landmark recommendation task as a collaborative filtering pro...
متن کاملScalable Maximum Margin Matrix Factorization by Active Riemannian Subspace Search
The user ratings in recommendation systems are usually in the form of ordinal discrete values. To give more accurate prediction of such rating data, maximum margin matrix factorization (MF) was proposed. Existing MF algorithms, however, either have massive computational cost or require expensive model selection procedures to determine the number of latent factors (i.e. the rank of the matrix to...
متن کاملMaximum Margin Code Recommendation
Code recommender systems ease the use and learning of software frameworks and libraries by recommending calls based on already present code. Typically, code recommender tools have been based on rather simple rule based systems. On the other hand recent advances in Recommender Systems and Collaborative Filtering have been mainly focused on rating data. While many of these advances can be incorpo...
متن کاملMaximum Margin Matrix Factorization with Netflix Data
Maximum Margin Matrix Factorization (MMMF), a collaborative filtering method, was recently introduced in [7] followed by an iterative solution presented in [6]. In this paper we analyze the performance of MMMF on a subset of the Netflix data based on RMSE and classification rate. We also present several modifications to improve the performance of the algorithm on the Netflix problem.
متن کامل